A Deterministic Approach of Merging of Blocks in Transversal Design based Key Predistribution

نویسندگان

  • Anupam Pattanayak
  • B. Majhi
چکیده

Transversal Design is a well known combinatorial design that has been used in deterministic key predistribution scheme. Merging of blocks in a design sometimes helps to obtain a key predistribution scheme with better performance. A deterministic merging strategy to merge the blocks has been discussed. Also, a simple key establishment method for transversal design based key predistribution scheme has been discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Practical Approaches to Varying Network Size in Combinatorial Key Predistribution Schemes

Combinatorial key predistribution schemes can provide a practical solution to the problem of distributing symmetric keys to the nodes of a wireless sensor network. Such schemes often inherently suit networks in which the number of nodes belongs to some restricted set of values (such as powers of primes). In a recent paper, Bose, Dey and Mukerjee have suggested that this might pose a problem, si...

متن کامل

Full Communication in a Wireless Sensor Network by Merging Blocks of a Key Predistribution using Reed Solomon Code

Wireless Sensor Networks (WSN) are constraint by the limited resources available to its constituting sensors. Thus the use of public-key cryptographyduring message exchange gets forbidden. One has to invoke symmetric key techniques. This leads to key distribution in the sensors which in itself is a major challenge. Again due to resource constraints, Key Predistrubution (KPD) methods are preferr...

متن کامل

Key Predistribution Scheme Using Affine Planes and Blom’s Scheme

In this paper we discuss the problem of designing a key predistribution scheme (KPS). We present a composite deterministic KPS based on “multiple key spaces” construction principle. As building blocks for it we take a KPS generated by affine planes and the well-known Blom’s scheme. The analysis of the resulting scheme shows its high global connectivity and resilience against nodes’ compromise. ...

متن کامل

Secure Key Pre-distribution in Wireless Sensor Networks Using Combinatorial Design and Traversal Design Based Key Distribution

Security is an indispensable concern in Wireless Sensor Network (WSN) due to the presence of potential adversaries. For secure communication in infrastructureless sensor nodes various key predistribution have been proposed. In this paper we have evaluated various existing deterministic, probabilistic and hybrid type of key pre-distribution and dynamic key generation algorithms for distributing ...

متن کامل

Assured Full Communication by Merging Blocksrandomly in Wireless Sensor Networks Usingreed Solomon Code for Key Predistribution

Limited resources available to the sensors (nodes) constituting a Wireless Sensor Network (WSN) is major constraint while dealing with security of such networks. This restrict us to use symmetric key cryptography instead of public-key techniques for transmission of message amongst the nodes. In any symmetric key system, both the sender and receiver must possess the unique enciphering and deciph...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2009  شماره 

صفحات  -

تاریخ انتشار 2009